CoCoALib documentation

نویسندگان

  • John Abbott
  • Anna M. Bigatti
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New in CoCoA-5.2.2 and CoCoALib-0.99560 for SC-Square

CoCoA-5 is an interactive Computer Algebra System for Computations in Commutative Algebra, particularly Gröbner bases. It offers a dedicated, mathematician-friendly programming language, with many built-in functions. Its mathematical core is CoCoALib, an opensource C++ library, designed to facilitate integration with other software. We give an overview of the latest developments of the library ...

متن کامل

CoCoA and CoCoALib: Fast Prototyping and Flexible C++ Library for Computations in Commutative Algebra

The CoCoA project began in 1987, and conducts research into Computational Commutative Algebra (from which its name comes) with particular emphasis on Gröbner bases of ideals in multivariate polynomial rings, and related areas. A major output of the project is the CoCoA software, including the CoCoA-5 interactive system and the CoCoALib C++ library. The software is open-source (GPL v.3), and und...

متن کامل

Groebner Bases for Everyone with CoCoA-5 and CoCoALib

We present a survey on the developments related to Gröbner bases, and show explicit examples in CoCoA. The CoCoA project dates back to 1987: its aim was to create a “mathematician”-friendly computational laboratory for studying Commutative Algebra, most especially Gröbner bases. Always maintaining this “friendly” tradition, the project has grown and evolved, and the software has been completely...

متن کامل

Janet Bases and Resolutions in CoCoALib

Recently, the authors presented a novel approach to computing resolutions and Betti numbers using Pommaret bases. For Betti numbers, this algorithm is for most examples much faster than the classical methods (typically by orders of magnitude). As the problem of δ-regularity often makes the determination of a Pommaret basis rather expensive, we extend here our algorithm to Janet bases. Although ...

متن کامل

Twin-float arithmetic

We present a heuristically certified form of floating-point arithmetic. As prerequisite we need floating-point arithmetic where the user can set the precision. Our work is developed from the idea of paired floats expounded by Traverso and Zanoni [2]. Twin-float arithmetic is suitable for use only where the input data are exact (or can be obtained to high enough precision). The arithmetic includ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015